[20260123] BOJ / G2 / 우수 마을 / 한종욱 #1820
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/1949
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
우수 마을을 선정할 때, 해당 우수 마을들의 주민의 총 합이 제일 높을 때의 주민의 수는?
🔍 풀이 방법
DFS로 우수 마을의 리프노드까지 탐색한 다음 마지막에서부터 다시 올라가는 바텀업으로 풀어야 한다.
⏳ 회고
BFS로 처음에 접근했다가 말도 안되게 상태정의를 열심히 해야해서 힘들었다.